France Telecom workforce scheduling problem: a challenge
نویسندگان
چکیده
منابع مشابه
Application of Particle Swarm Optimization to the British Telecom Workforce Scheduling Problem
When technicians are deployed in field service, they must be allocated to the correct assignment and their routes should also be optimised as a part of that process. Data from a practical case of British Telecom has been used widely in the literature to test many different solution methods. This work discusses the modification of particle swarm optimization (PSO) for this problem and compares t...
متن کاملEmpowerment-based Workforce Scheduling Problem∗
The Workforce Scheduling Problem (WSP) concerns the scheduling of a multi-skilled workforce to geographically dispersed tasks. An effective solution to the problem is critical to companies’ performance and success. Organizations are becoming increasingly aware of the importance of enhancing employee empowerment and involvement in decision making. However, traditional approaches implemented to t...
متن کاملMobile Workforce Scheduling Problem with Multitask-Processes
In this work we introduce a new generalization of the ResourceConstrained Project Scheduling Problem – the Mobile Workforce Scheduling Problem with Multitask-Processes (MWSP-MP). This scheduling problem arises in mobile work scenarios and is characterized by tasks to be scheduled that are not independent from each other, but belong to structured business processes. These business processes are ...
متن کاملTitle : Fast Local Search and Guided Local Search and Their Application to British Telecom ’ s Workforce Scheduling Problem
This paper reports a Fast Local Search (FLS) algorithm which helps to improve the efficiency of hill climbing and a Guided Local Search (GLS) Algorithm which is developed to help local search to escape local optima and distribute search effort. To illustrate how these algorithms work, this paper describes their application to British Telecom’s workforce scheduling problem, which is a hard real ...
متن کاملMin Conflicts Based Heuristics for Rotating Workforce Scheduling Problem
Workforce scheduling problems are typical constraint satisfaction problems in which different constraints must be fulfilled, like needed workforce per day, forbidden sequences of shifts, length of work and days-off blocks etc. There are two main variants of workforce schedules: rotating (or cyclic) workforce schedules and non-cyclic workforce schedules. In a rotating workforce schedule all empl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Operations Research
سال: 2009
ISSN: 0399-0559,1290-3868
DOI: 10.1051/ro/2009025